On Inducing n-gons
نویسندگان
چکیده
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.
منابع مشابه
Application of Functionalized Graphene Oxide Nanosheet in Gas Separation
Graphene oxide nanosheet (GONS) can be a suitable membrane for gas separation with high permeability and selectivity. Separation of N2/CO2 using functionalized GONS was investigated by molecular dynamics simulations. The simulated systems were comprised of two types of GONS with a pore in their center, N2 and CO2 molecules. The selectivity and ...
متن کاملVERY HOMOGENEOUS GENERALIZED n-GONS OF FINITE MORLEY RANK
(Almost strongly minimal) generalized n-gons are constructed for all n& 3 for which the automorphism group acts transitively on the set of ordered ordinary (n1)-gons contained in it, a new class of BN-pairs thus being obtained. Through the construction being modified slightly, 2! many non-isomorphic almost strongly minimal generalized n-gons are obtained for all n& 3, none of which interprets ...
متن کاملOn 5-Gons and 5-Holes
We consider an extention of a question of Erdős on the number of k-gons in a set of n points in the plane. Relaxing the convexity restriction we obtain results on 5-gons and 5-holes (empty 5-gons).
متن کاملOn the rigidity of regular bicycle (n, k)-gons
Bicycle (n, k)-gons are equilateral n-gons whose k-diagonals are equal. In this paper, the order of infinitesimal flexibility of the regular n-gon within the family of bicycle (n, k)-gons is studied. An equation characterizing first order flexible regular bicycle (n, k)-gons were computed by S. Tabachnikov in [7]. This equation was solved by R. Connelly and the author in [3]. S. Tabachnikov has...
متن کاملOn k-Gons and k-Holes in Point Sets
We consider a variation of the classical Erdős-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show bounds and structural results on maximizing and minimizing their numbers. Most noteworthy, for any k and sufficiently large n, we give a quadratic lower bound for the number of k-...
متن کامل